Traversal times for random walks on small-world networks
نویسندگان
چکیده
منابع مشابه
Traversal times for random walks on small-world networks.
We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate that is different from the rate for steps across small-world connections. When f>>F, the mean time to traverse the network exhibits a transition associated with percolation of the random graph (i.e., small-world) part of th...
متن کاملRandom Walks on Small World Networks
We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices {u, v} with distance d > 1 is added as a “long-range” edge with probability proportional to d−r, where r ≥ 0 is a parameter of the model. Kleinberg studied a close variant of this network model and proved that the (decentralised) routing time...
متن کاملScaling properties of random walks on small-world networks.
Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These properties include the average number of distinct sites visited by the random walker, the mean-square displacement of the walker, and the distribution of fir...
متن کاملCharacteristic times of biased random walks on complex networks
We consider degree-biased random walkers whose probability to move from a node to one of its neighbors of degree k is proportional to k(α), where α is a tuning parameter. We study both numerically and analytically three types of characteristic times, namely (i) the time the walker needs to come back to the starting node, (ii) the time it takes to visit a given node for the first time, and (iii)...
متن کاملMixing Times for Random Walks on Geometric Random Graphs
A geometric random graph, G(n, r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each other. The G(n, r) has been of great interest due to its success as a model for ad-hoc wireless networks. It is well known that the connectivity of G(n, r) exhibits a threshold property: there exists a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.72.056119